Recursive M-Tree Method for 3-D Adaptive Tetrahedral Mesh Refinement and Its Application to Brillouin Zone Discretization
نویسندگان
چکیده
Abstract We present a high speed adaptive tetrahedral mesh refinement method based on the Recursive Multi-Tree algorithm. To our knowledge, this is the first refinement algorithm that is able to improve the quality of the original mesh. In this paper, the method has been applied to discretize the Brillouin zone of silicon for full band Monte Carlo device simulation. Densities of states for seven electron and hole bands of silicon are computed based on the new refined tetrahedral meshes.
منابع مشابه
woptic: Optical conductivity with Wannier functions and adaptive k-mesh refinement
We present an algorithm for the adaptive tetrahedral integration over the Brillouin zone of crystalline materials, and apply it to compute the optical conductivity, dc conductivity, and thermopower. For these quantities, whose contributions are often localized in small portions of the Brillouin zone, adaptive integration is especially relevant. Our implementation, thewoptic package, is tied int...
متن کاملLOCAL MULTIGRID IN H(curl)
We consider H(curl, Ω)-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral mesh has been created by successive local mesh refinement, either by local uniform refinement with hanging nodes or bisection refinement. In this setting we develop a convergence the...
متن کاملParallel adaptive mesh-refining scheme on a three-dimensional unstructured tetrahedral mesh and its applications
The development of a parallel three-dimensional (3-D) adaptive mesh refinement (PAMR) scheme for an unstructured tetrahedral mesh using dynamic domain decomposition on a memory-distributed machine is presented in detail. A memory-saving cell-based data structure is designed such that the resulting mesh information can be readily utilized in both nodeor cell-based numerical methods. The general ...
متن کاملDevelopment of a parallel Poisson's equation solver with adaptive mesh refinement and its application in field emission prediction
A parallel electrostatic Poisson’s equation solver coupled with parallel adaptive mesh refinement (PAMR) is developed in this paper. The three-dimensional Poisson’s equation is discretized using the Galerkin finite element method using a tetrahedral mesh. The resulting matrix equation is then solved through the parallel conjugate gradient method using the non-overlapping subdomain-by-subdomain ...
متن کاملRecursive Tetrahedral Meshes for Scientific Visualization
The advent of high-performance computing has completely transformed the nature of most scientific and engineering disciplines, making the study of complex problems from experimental and theoretical disciplines computationally feasible. All science and engineering disciplines are facing the same problem: how to archive, transmit, visualize, and explore the massive data sets resulting from modern...
متن کامل